Probabilistic Concurrent Kleene Algebra
نویسندگان
چکیده
We provide an extension of concurrent Kleene algebras to account for probabilistic properties. The algebra yields a unified framework containing nondeterminism, concurrency and probability and is sound with respect to the set of probabilistic automata modulo probabilistic simulation. We use the resulting algebra to generalise the algebraic formulation of a variant of Jones’ rely/guarantee calculus.
منابع مشابه
Algebraic verification of probabilistic and concurrent systems
This thesis provides an algebraic modelling and verification of probabilistic concurrent systems in the style of Kleene algebra. Without concurrency, it is shown that the equational theory of continuous probabilistic Kleene algebra is complete with respect to an automata model under standard simulation equivalence. This yields a minimisation-based decision procedure for the algebra. Without pro...
متن کاملProbabilistic rely-guarantee calculus
Jones’ rely-guarantee calculus [1] for shared variable concurrency is extended to include probabilistic behaviours. We use an algebraic approach which combines and adapts probabilistic Kleene algebras with concurrent Kleene algebra. Soundness of the algebra is shown relative to a general probabilistic event structure semantics [21]. The main contribution of this paper is a collection of rely-gu...
متن کاملAn Event Structure Model for Probabilistic Concurrent Kleene Algebra
We give a new true-concurrent model for probabilistic concurrent Kleene algebra. The model is based on probabilistic event structures, which combines ideas from Katoen’s work on probabilistic concurrency and Varacca’s probabilistic prime event structures. The event structures are compared with a true-concurrent version of Segala’s probabilistic simulation. Finally, the algebraic properties of t...
متن کاملWeak Concurrent Kleene Algebra with Application to Algebraic Verification
We propose a generalisation of concurrent Kleene algebra [5] that can take account of probabilistic effects in the presence of concurrency. The algebra is proved sound with respect to a model of automata modulo a variant of rooted η-simulation equivalence. Applicability is demonstrated by algebraic treatments of two examples: algebraic may testing and Rabin’s solution to the choice coordination...
متن کاملDecision Methods for Concurrent Kleene Algebra with Tests : Based on Derivative
Concurrent Kleene Algebra with Tests (CKAT) were introduced by Peter Jipsen[Jip14]. We give derivatives for CKAT to decide word problems, for example emptiness, equivalence, containment problems. These derivative methods are expanded from derivative methods for Kleene Algebra and Kleene Algebra with Tests[Brz64][Koz08][ABM12]. Additionally, we show that the equivalence problem of CKAT is in EXP...
متن کامل